#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        vector<vector<int>> dp(m + 1, vector(n + 1, INT_MAX));
        dp[0][1] = 0;
        dp[1][0] = 0;
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
                dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i - 1][j - 1];
        // for (int i = 0; i <= m; i++) {
        //     for (int j = 0; j <= n; j++)
        //         cout << dp[i][j] << ' ';
        //     cout<<endl;
        // }
        return dp[m][n];
    }
};